About the cumulative idle time in multiphase queues

نویسندگان

  • Saulius Minkevicius
  • Stasys Steisunas
چکیده

The paper is designated to the analysis of queueing systems, arising in the network theory and communications theory (called multiphase queueing systems, tandem queues or series of queueing systems). Also we note that multiphase queueing systems can be useful for modelling practical multi-stage service systems in a variety of disciplines, especially on manufacturing (assembly lines), computer networking (packet switch structures), and in telecommunications (e.g. cellular mobile networks), etc. This research presents heavy traffic limit theorems for the cumulative idle time in multiphase queues. In this work, functional limit theorems are proved for the values of important probability characteristics of the queueing system (a cumulative idle time of a customer).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fluid Limit for Cumulative Idle Time in Multiphase Queues

Abstract: The object of this research in the queueing theory is the FunctionalStrong-Law-ofLarge-Numbers (FSLLN) under the conditions of heavy traffic in Multiphase Queueing Systems (MQS). A FSLLN is known as fluid limit or fluid approximation. In this paper, the FSLLN is proved for values of important probabilistic characteristics of the MQS investigated as well as the summary queue length of ...

متن کامل

About cumulative idle time model of the message switching system

The purpose of this research in the queueing theory is the theorem about the law of the iterated logarithm in multiphase queueing systems and its application to the mathematical model of the message switching system. First the law of the iterated logarithm is proved for the cumulative idle time of a customer. Finally we present an application of the proved theorem for the model of the message s...

متن کامل

A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

متن کامل

Some Inequalities for Single Server Queues

The expected wait in the Gi/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are 1FR or have mean residual life bounded by r-, simple bounds are obtained which A. give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions foi the mo...

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • RAIRO - Operations Research

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2005